翻訳と辞書 Words near each other ・ Ramenki ・ Ramenki (Moscow Metro) ・ Ramenki (rural locality) ・ Ramenki District ・ Ramenos ・ Ramenskoye Airport ・ Ramenskoye, Moscow Oblast ・ Ramensky ・ Ramensky (inhabited locality) ・ Ramensky District ・ Ramer ・ Ramer, Alabama ・ Ramer, Tennessee ・ Ramerberg ・ Ramerupt ・ Ramer–Douglas–Peucker algorithm ・ Rameses (mascot) ・ Rameses Revenge ・ Ramesh ・ Ramesh (name) ・ Ramesh Agrawal ・ Ramesh Aravind ・ Ramesh Aravind filmography ・ Ramesh Awtaney ・ Ramesh Bais ・ Ramesh Balakrishnan ・ Ramesh Balsekar ・ Ramesh Barial ・ Ramesh Bhat ・ Ramesh Bhatkar Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Ramer–Douglas–Peucker algorithm ： ウィキペディア英語版 Ramer–Douglas–Peucker algorithm The Ramer–Douglas–Peucker algorithm (RDP) is an algorithm for reducing the number of points in a curve that is approximated by a series of points. The initial form of the algorithm was independently suggested in 1972 by Urs Ramer and 1973 by David Douglas and Thomas Peucker〔See the References for more details〕 and several others in the following decade. This algorithm is also known under the names Douglas–Peucker algorithm, iterative end-point fit algorithm and split-and-merge algorithm. == Idea == The purpose of the algorithm is, given a curve composed of line segments, to find a similar curve with fewer points. The algorithm defines 'dissimilar' based on the maximum distance between the original curve and the simplified curve (i.e., the Hausdorff distance between the curves). The simplified curve consists of a subset of the points that defined the original curve. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ramer–Douglas–Peucker algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.